Solving Geometric Problems by Using Algebraic Representation for Junior High School Level 3 in Van Hiele at Geometric Thinking Level
نویسندگان
چکیده
منابع مشابه
Classification Using Geometric Level Sets
A variational level set method is developed for the supervised classification problem. Nonlinear classifier decision boundaries are obtained by minimizing an energy functional that is composed of an empirical risk term with a margin-based loss and a geometric regularization term new to machine learning: the surface area of the decision boundary. This geometric level set classifier is analyzed i...
متن کاملAn Application of the Generalized Rectangular Fuzzy Assessment Model to the van Hiele Level Theory of Geometric Reasoning
The Generalized Rectangular Fuzzy Assessment Model (GRFAM) is applied for the evaluation of student group acquisition of the van Hiele levels of geometric reasoning and an example is presented illustrating our results. The GRFAM is a variation of the Center of Gravity defuzzification technique created in an effort to treat better the ambiguous assessment cases being at the boundaries between an...
متن کاملSolving Geometric Optimization Problems
We show how to use graphics hardware for tackling optimization problems arising in the field of computational geometry. We exemplarily discuss three problems, where combinatorial algorithms are inefficient or hard to implement. Given a set S of n point in the plane, the first two problems are to determine the smallest homothetic scaling of a star shaped polygon P enclosing S and to find the lar...
متن کاملLevel Set Methods for Geometric Inverse Problems in Linear Elasticity
In this paper we investigate the regularization and numerical solution of geometric inverse problems related to linear elasticity with minimal assumptions on the geometry of the solution. In particular we consider the probably severely ill-posed reconstruction problem of a twodimensional inclusion from a single boundary measurement. In order to avoid parameterizations, which would introduce a-p...
متن کاملSolving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core problem is a geometric set covering problem which is NP-hard in general. However, if the corresponding covering matrix has the consecutive ones property, it is solvable in polynomial time. In this paper, we present data re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Education Studies
سال: 2016
ISSN: 1913-9039,1913-9020
DOI: 10.5539/ies.v9n10p27